Automatically improving the anytime behaviour of optimisation algorithms
نویسندگان
چکیده
منابع مشابه
Automatically improving the anytime behaviour of optimisation algorithms
Optimisation algorithms with good anytime behaviour try to return as high-quality solutions as possible independently of the computation time allowed. Designing algorithms with good anytime behaviour is a difficult task, because performance is often evaluated subjectively, by plotting the trade-off curve between computation time and solution quality. Yet, the trade-off curve may be modelled als...
متن کاملAutomatically Improving the Anytime Behaviour of Optimisation Algorithms: Supplementary material
Optimisation algorithms with good anytime behaviour try to return as high-quality solutions as possible independently of the computation time allowed. Designing algorithms with good anytime behaviour is a difficult task, because performance is often evaluated subjectively, by plotting the trade-off curve between computation time and solution quality. Yet, the trade-off curve may be modelled als...
متن کاملAutomatically Improving the Anytime Behaviour of Multiobjective Evolutionary Algorithms
Abstract. An algorithm that returns as low-cost solutions as possible at any moment of its execution is said to have a good anytime behaviour. The problem of optimising anytime behaviour can be modelled as a biobjective non-dominated front, where the goal is to minimise both time and cost. Using a unary quality measure such as the hypervolume indicator, the analysis of the anytime behaviour can...
متن کاملProgramming with Anytime Algorithms
Anytime algorithms are playing an increasingly important role in the construction of effective reasoning and planning systems. Early work on anytime algorithms concentrated on the construction of applications in such areas as medical diagnosis and mobile robot navigation. In this paper we describe a programming environment to support the development of such applications as well as larger applic...
متن کاملAnytime Planning For Agent Behaviour
For an agent to act successfully in a complex and dynamic environment (such as a computer game) it must have a method of generating future behaviour that meets the demands of its environment. One such method is anytime planning. This paper discusses the problems and benefits associated with making a planning system work under the anytime paradigm, and introduces AnytimeUMCP (A-UMCP), an anytime...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2014
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2013.10.043